Internet packet routing: Application of a K-quickest path algorithm
نویسندگان
چکیده
منابع مشابه
Internet packet routing: Application of a K
This paper describes a study on the application of an algorithm to rank the K-quickest paths to the routing of data packets in Internet networks. For this purpose an experimental framework was developed by considering two types of random generated networks. To simulate values of the IP packet sizes, a truncated Pareto distribution was defined, having in mind to reflect a key feature of Internet...
متن کاملProbabilistic quickest path algorithm
Due to the increasing role of quickest paths for on-demand routing in computer networks, it is important to compute them faster, perhaps, by trading-o3 the quality for computational speed. We consider the computation of a quickest path from a source node to a destination node for a given message size in a network with n nodes and m links each of which is speci6ed by bandwidth and delay. Every k...
متن کاملThe Application of K–Shortest Path Algorithm in Multicast Routing
Abstract. There have been many heuristic algorithms finding multicast trees proposed over the past few years. The necessity for finding a better and more suitable algorithm is still a current and important challenge. The article presents a new multicast routing algorithm for finding a multicast tree in packet networks. The objective of the K-Shortest Path Multicast Algorithm (KSPMA) is to minim...
متن کاملEnergy Efficient Multi Path Routing Protocol in Internet of Things
Internet of things (IoT) is a network with a wide range of smart and physical objects and gadgets that can exchange information with each other. IOT introduces a variety of services that human life is dependent on its secure and accessible activities. These networks face numerous problems in terms of energy consumption and reliable communication to send the correct data. Moreover, the character...
متن کاملApplying Packet Routing Algorithm for Routing AGVs in a Mesh-like Path Topology (II): a Proof of the Algorithm
We present an algorithm in [1] to route AGVs in a mesh-like path topology within three phases. The first phase is a vertical exchange of vehicles so that finally for every row each vehicle has a unique destination column ID; the second phase is a horizontal exchange of vehicles which leads to that every vehicle gets to its right destination column; and the last phase is again a vertical exchang...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2007
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2006.03.013